Forest Cuts in Sparse Graphs. Vsevolod Chernyshev, JR, Dieter Rautenbach. arXiv

Participated in PACE 2024. Source code, results

On Conflict-Free Cuts: Algorithms and Complexity. JR, Dieter Rautenbach, Uéverton S. Souza. arXiv, Information Processing Letters

Exact and Parameterized Algorithms for the Independent Cutset Problem. JR, Dieter Rautenbach, Uéverton S. Souza. arXiv, Fundamentals of Computation Theory, Journal of Computer and System Sciences

Sparse vertex cutsets and the maximum degree. Stéphane Bessy, JR, Dieter Rautenbach, Uéverton S. Souza. arXiv

Efficiently recognizing graphs with equal independence and annihilation numbers. JR, Dieter Rautenbach. arXiv, Information Processing Letters